Signal Processing on Simplicial Complexes

نویسندگان

چکیده

Higher-order networks have so far been considered primarily in the context of studying structure complex systems, i.e., higher-order or multi-way relations connecting constituent entities. More recently, a number studies dynamical processes that explicitly account for such dependencies, e.g., epidemic spreading opinion formation. In this chapter, we focus on closely related, but distinct third perspective: how can use relationships to process signals and data supported network structures. particular, survey ideas from signal processing regular domains, as time series images, be extended graphs simplicial complexes. We discuss Fourier analysis, denoising, interpolation, nonlinear through neural based Key our developments is Hodge Laplacian matrix, multi-relational operator leverages special complexes generalizes desirable properties matrix graph processing.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flows on Simplicial Complexes

Given a graph G, the number of nowhere-zero Zq-flows φG(q) is known to be a polynomial in q. We extend the definition of nowhere-zero Zq-flows to simplicial complexes ∆ of dimension greater than one, and prove the polynomiality of the corresponding function φ∆(q) for certain q and certain subclasses of simplicial complexes. Résumé. Et́ant donné une graphe G, on est connu que le nombre de Zq-flot...

متن کامل

A duality on simplicial complexes

The usual definition of finite simplicial complex is a set of non-empty subsets of a finite set, closed under non-empty subset formation. For our purposes here, we will omit the non-emptiness and define a finite simplicial complex to be a down-closed subset of the set of subsets of a finite set. We can, and will suppose that the finite set is the integers 0,. . . ,N . We will denote by K the se...

متن کامل

Simplicial Moves on Balanced Complexes

We introduce a notion of cross-flips: local moves that transform a balanced (i.e., properly (d + 1)-colored) triangulation of a combinatorial d-manifold into another balanced triangulation. These moves form a natural analog of bistellar flips (also known as Pachner moves). Specifically, we establish the following theorem: any two balanced triangulations of a closed combinatorial d-manifold can ...

متن کامل

On Finite Arithmetic Simplicial Complexes

We compute the Euler-Poincaré characteristic of quotients of the Bruhat-Tits building of PGL(n) under the action of arithmetic groups arising from central division algebras over rational function fields of positive characteristic. We use this result to determine the structure of the quotient simplicial complex in certain cases.

متن کامل

Face enumeration on simplicial complexes

Let M be a closed triangulable manifold, and let ∆ be a triangulation of M. What is the smallest number of vertices that ∆ can have? How big or small can the number of edges of ∆ be as a function of the number of vertices? More generally, what are the possible face numbers ( f -numbers, for short) that ∆ can have? In other words, what restrictions does the topology of M place on the possible f ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Understanding complex systems

سال: 2022

ISSN: ['1860-0840', '1860-0832']

DOI: https://doi.org/10.1007/978-3-030-91374-8_12